TU Berlin

Modelle und Theorie Verteilter SystemePublikationen

MTV mit Schwung

Inhalt des Dokuments

zur Navigation

Publikationen

{

Wilhelm-Weidner, Arno and Bergner, Nadine (2018). Vergleich von Lernstilen und deren Umsetzungsmöglichkeiten im LMS Moodle. Das Elektronische Schulbuch 2017: Fachdidaktische Anforderungen und Ideen treffen auf Lösungsvorschläge der Informatik. LIT Verlag, 25–37.


Wilhelm-Weidner, Arno and Bergner, Nadine (2018). On Supplementing Theoretical Computer Science Courses Using E-Learning. Proceedings of the 18th Koli Calling International Conference on Computing Education Research. ACM, 14:1–14:10.

Link zur Publikation

W

Wolf, Alexander and Wilhelm-Weidner, Arno and Nestmann, Uwe (2018). A Case Study of Flipped Classroom for Automata Theory in Secondary Education. Proceedings of the 13th Workshop in Primary and Secondary Computing Education. ACM, 23:1–23:6.

Link zur Publikation

Wilhelm-Weidner, Arno and Nestmann, Uwe (2017). Interaktives Erstellen mobiler Lerneinheiten mit MobiMat. Das Elektronische Schulbuch 2016. LIT Verlag.


Wilhelm-Weidner, Arno (2015). MobiMat – ein Framework zur Mobilisierung von Lehrmaterial. Proceedings of DeLFI Workshops 2015 co-located with 13th e-Learning Conference of the German Computer Society (DeLFI 2015). CEUR-WS.org, 239–243.

Link zur Originalpublikation

Wagner, Christoph and Nestmann, Uwe (2014). States in Process Calculi. EXPRESS/SOS, 48-62.

Link zur Publikation

S


Schneider, Sven and Borgström, Johannes and Nestmann, Uwe (2008). Towards the application of process calculi in the domain of peer-to-peer algorithms. Autonomous Systems–Self-Organization, Management, and Control. Springer Netherlands, 97–104.

Link zur Originalpublikation

Schneider, Sven and Nestmann, Uwe (2011). Rigorous Discretization of Hybrid Systems Using Process Calculi. FORMATS. Springer, 301-316.

Link zur Originalpublikation

Schneider, Sven and Schmuck, Anne-Kathrin and Nestmann, Uwe and Raisch, Jörg (2014). Reducing an Operational Supervisory Control Problem by Decomposition for Deterministic Pushdown Automata. WODES, 214-221.

Link zur Originalpublikation

Schmuck, Anne-Kathrin and Schneider, Sven and Raisch, Jörg and Nestmann, Uwe (2014). Extending Supervisory Controller Synthesis to Deterministic Pushdown Automata - Enforcing Controllability Least Restrictively. WODES, 286-293.

Link zur Originalpublikation

Schmuck, Anne-Kathrin and Schneider, Sven and Raisch, Jörg and Nestmann, Uwe (2015). Supervisory control synthesis for deterministic context free specification languages. Discrete Event Dynamic Systems. Springer US, 1-28.

Link zur Originalpublikation

Schmuck, Anne-Kathrin and Schneider, Sven and Raisch, Jörg and Nestmann, Uwe (2016). Supervisory control synthesis for deterministic context free specification languages. Discrete Event Dynamic Systems. Springer US, 5–32.


Sarrouh, Nadim and Eilers, Florian and Nestmann, Uwe and Schieferdecker, Ina (2010). Defamation-Free Networks through User-Centered Data Control. STM. Springer, 179-193.

Link zur Originalpublikation

Sarrouh, Nadim and Blankenstein, Oliver and Nestmann, Uwe (2010). Service-Orientierte Unterstützung des nationalen Früherkennungsprogramms für Kinder. GI Jahrestagung (1). GI, 229-234.

Link zur Originalpublikation

R

Rickmann, Christina and Wagner, Christoph and Nestmann, Uwe and Schmid, Stefan (2016). Topological Self-Stabilization with Name-Passing Process Calculi. 27th International Conference on Concurrency Theory, CONCUR 2016, August 23-26, 2016, Québec City, Canada, 19:1–19:15.

Link zur Publikation

P

Prehn, Tobias and Rotter, Myron (2019). Immediate Observation in Mediated Population Protocols. Proceedings Combined 26th International Workshop on Expressiveness in Concurrency and 16th Workshop on Structural Operational Semantics, Amsterdam, The Netherlands, 26th August 2019. Open Publishing Association, 102-113.

Link zur Originalpublikation

Peters, Kirstin and Wagner, Christoph and Nestmann, Uwe (2019). Taming Concurrency for Verification Using Multiparty Session Types. Theoretical Aspects of Computing – ICTAC 2019. Lecture Notes in Computer Science. Springer, Cham, 196-215.

Link zur Originalpublikation

Peters, Kirstin and Yonova-Karbe, Tsvetelina and Nestmann, Uwe (2014). Matching in the Pi-Calculus. EXPRESS/SOS, 16-29.

Link zur Publikation



Peters, Kirstin and Nestmann, Uwe and Goltz, Ursula (2013). On Distributability in Process Calculi. ESOP. Springer, 310-329.

Link zur Originalpublikation

Peters, Kirstin and Schicke, Jens-Wolfhard and Nestmann, Uwe (2011). Synchrony vs Causality in the Asynchronous Pi-Calculus. EXPRESS, 89-103.

Link zur Publikation

Peters, Kirstin and Nestmann, Uwe (2010). Breaking Symmetries. CoRR

Link zur Publikation

Peters, Kirstin and Nestmann, Uwe (2012). Is It a "Good" Encoding of Mixed Choice?. FoSSaCS. Springer, 210-224.

Link zur Originalpublikation

Peters, Kirstin and Yonova-Karbe, Tsvetelina and Nestmann, Uwe (2014). Matching in the Pi-Calculus (Technical Report). CoRR

Link zur Publikation

Peters, Kirstin and Nestmann, Uwe (2016). Breaking Symmetries. Mathematical Structures in Computer Science, 1054–1106.


Peters, Kirstin and Jens-Wolfhard Schicke-Uffmann and Goltz, Ursula and Nestmann, Uwe (2016). Synchrony versus causality in distributed systems. , 1459–1498.


N


Uwe Nestmann and Björn Victor (2005). Guest editors' introduction: Special issue on The pi-calculus. J. Log. Algebr. Program., 1-2.

Link zur Publikation

Uwe Nestmann and Rachele Fuzzati (2003). Unreliable Failure Detectors via Operational Semantics. ASIAN, 54-71.

Link zur Originalpublikation

Uwe Nestmann and Rachele Fuzzati and Massimo Merro (2003). Modeling Consensus in a Process Calculus. CONCUR, 393-407.

Link zur Originalpublikation

Uwe Nestmann and Prakash Panangaden (2003). Guest Editors' Foreword. Nord. J. Comput., 69.


Uwe Nestmann and Prakash Panangaden (2002). Preface. Electr. Notes Theor. Comput. Sci.

Link zur Publikation

Uwe Nestmann and Hans Hüttel and Josva Kleist and Massimo Merro (2002). Aliasing Models for Mobile Objects. Inf. Comput., 3-33.

Link zur Publikation

Uwe Nestmann (2000). What is a "Good" Encoding of Guarded Choice?. Inf. Comput., 287-319.


Uwe Nestmann and Benjamin C. Pierce (2000). Decoding Choice Encodings. Inf. Comput., 1-59.


Uwe Nestmann and António Ravara (1999). Semantics of Objects as Processes (SOAP). ECOOP Workshops, 314-325.

Link zur Originalpublikation

Uwe Nestmann and Hans Hüttel and Josva Kleist and Massimo Merro (1999). Aliasing Models for Object Migration. Euro-Par, 1353-1368.

Link zur Originalpublikation

Uwe Nestmann (1999). Mobile Objects (a project overview). FBT, 155-164.


Uwe Nestmann and Björn Victor (1998). Calculi for Mobile Processes - Bibliography and Web Pages. Bulletin of the EATCS


Uwe Nestmann (1998). On the Expressive Power of Joint Input. Electr. Notes Theor. Comput. Sci.

Link zur Publikation

Uwe Nestmann and Benjamin C. Pierce (1998). Preface. Electr. Notes Theor. Comput. Sci.

Link zur Publikation

Uwe Nestmann (1997). What is a `good' encoding of guarded choice?. Electr. Notes Theor. Comput. Sci.

Link zur Publikation

Uwe Nestmann and Benjamin C. Pierce (1996). Decoding Choice Encodings. CONCUR, 179-194.

Link zur Originalpublikation

Uwe Nestmann and Martin Steffen (1995). Correct Transformational Design of Concurrent Search Structures. Object Orientation with Parallelism and Persistence, 23-42.


Nestmann, Uwe and Puhlmann, Frank (2008). Business Process Specification and Analysis. Process Algebra for Parallel and Distributed Processing. CRC Press, 129.


Nestmann, Uwe (2013). 3.12 Verifying Consensus... Using Process Calculi, State Machines, and Proof Checkers. Formal Verification of Distributed Algorithms, 10.

Link zur Publikation



Navigation

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe